New Dispatching Rules for Scheduling in a Job Shop - an Experimental Study
نویسندگان
چکیده
We present two new dispatching rules for scheduling in a job shop. These rules combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches. An extensive and rigorous simulation study has been carried out to evaluate the performance of the proposed dispatching rules against those by the SPT rule, the WINQ rule, a random rule based on the SPT and WINQ rules, and the best existing rule. The important aspects of the results of the experimental investigation are also discussed in detail.
منابع مشابه
Classification Rules for the Job Shop Scheduling Problem with Machine Breakdowns
This paper addresses the job shop scheduling problem in the presence of machine breakdowns. In this work, we propose to exploit the advantages of data mining techniques to resolve the problem. We proposed an approach to discover a set of classification rules by using historic scheduling data. Intelligent decisions are then made in real time based on this constructed rules to assign the correspo...
متن کاملEvolving Dispatching Rules with Greater Understandability for Dynamic Job Shop Scheduling
Heuristic dispatching rules are one of the most popular and widely used methods of scheduling in dynamic job shop environments. The manual development of such dispatching rules is time consuming and requires substantial knowledge of the domain. There have been numerous works into using genetic programming (GP) as a framework for the automated generation of dispatching rules for job shop schedul...
متن کاملEvolving Time-Invariant Dispatching Rules in Job Shop Scheduling with Genetic Programming
Genetic Programming (GP) has achieved success in evolving dispatching rules for job shop scheduling problems, particularly in dynamic environment. However, there is still great potential to improving the performance of GP. One challenge that is yet to be addressed is the huge search space. In this paper, we propose a simple yet effective approach to improve the effectiveness and efficiency of G...
متن کاملLearning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees, Tabu Search and Simulation
A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in chang...
متن کاملComparing Dispatching Rules in An Open Shop-A Simulation Study
Scheduling problems in an open shop is more complicated than others since jobs do not follow a certain route in the system. This study uses computer simulation to compare the performance of different dispatching rules in an open shop. We find that the choice of the best dispatching rule is affected by the utilization factor, due-date factors, and the process time distribution at each station. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007